On Smoothing Methods for the P0 Matrix Linear Complementarity Problem
نویسنده
چکیده
In this paper, we propose a Big-? smoothing method for solving the P 0 matrix linear complementarity problem. We study the trajectory deened by the augmented smoothing equations and global convergence of the method under an assumption that the original P 0 matrix linear complementarity problem has a solution. The method has been tested on the P 0 matrix linear complementarity problem with unbounded solution set. Preliminary numerical results indicate the robustness of the method.
منابع مشابه
An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملSub-quadratic convergence of a smoothing Newton algorithm for the P 0- and monotone LCP
Given M ∈ <n×n and q ∈ <, the linear complementarity problem (LCP) is to find (x, s) ∈ < × < such that (x, s) ≥ 0, s = Mx + q, x s = 0. By using the ChenHarker-Kanzow-Smale (CHKS) smoothing function, the LCP is reformulated as a system of parameterized smooth-nonsmooth equations. As a result, a smoothing Newton algorithm, which is a modified version of the Qi-Sun-Zhou algorithm [Mathematical Pr...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملSmoothing Methods for Nonlinear Complementarity Problems
In this paper, we present a new smoothing approach to solve general nonlinear complementarity problems. Under the P0 condition on the original problems, we prove some existence and convergence results . We also present an error estimate under a new and general monotonicity condition. The numerical tests confirm the efficiency of our proposed methods.
متن کامل